. so c - ph ] 3 0 Se p 20 14 A unified data representation theory for network visualization , ordering and coarse - graining
نویسندگان
چکیده
István A. Kovács, 2, ∗ Réka Mizsei, and Péter Csermely Wigner Research Centre, Institute for Solid State Physics and Optics, H-1525 Budapest, P.O.Box 49, Hungary Institute of Theoretical Physics, Szeged University, H-6720 Szeged, Hungary Institute of Organic Chemistry, Research Centre for Natural Sciences, Hungarian Academy of Sciences, Pusztaszeri út 59-67, H-1025 Budapest, Hungary Department of Medical Chemistry, Semmelweis University, H-1444 Budapest, P.O.Box 266, Hungary (Dated: October 1, 2014)
منابع مشابه
A unified data representation theory for network visualization, ordering and coarse-graining
Representation of large data sets became a key question of many scientific disciplines in the last decade. Several approaches for network visualization, data ordering and coarse-graining accomplished this goal. However, there was no underlying theoretical framework linking these problems. Here we show an elegant, information theoretic data representation approach as a unified solution of networ...
متن کاملInformation : A unified data representation theory for network visualization , ordering and coarse - graining
István A. Kovács∗,1, 2, 3 Réka Mizsei, and Péter Csermely Wigner Research Centre, Institute for Solid State Physics and Optics, H-1525 Budapest, P.O.Box 49, Hungary Institute of Theoretical Physics, Szeged University, H-6720 Szeged, Hungary Center for Complex Networks Research and Department of Physics, Northeastern University, 110 Forsyth Street, 111 Dana Research Center, Boston, MA 02115, USA...
متن کاملVersatile Object-Oriented Toolkit for Coarse-Graining Applications.
Coarse-graining is a systematic way of reducing the number of degrees of freedom representing a system of interest. Several coarse-graining techniques have so far been developed, such as iterative Boltzmann inversion, force-matching, and inverse Monte Carlo. However, there is no unified framework that implements these methods and that allows their direct comparison. We present a versatile objec...
متن کامل. so c - ph ] 2 5 Se p 20 09 Community detection in networks with positive and negative links
Detecting communities in complex networks accurately is a prime challenge, preceding further analyses of network characteristics and dynamics. Until now, community detection took into account only positively valued links, while many actual networks also feature negative links. We extend an existing Potts model to incorporate negative links as well, resulting in a method similar to the clusterin...
متن کاملGeometric Unification of Evolutionary Algorithms
Evolutionary algorithms are only superficially different and can be unified within an axiomatic geometric framework by abstraction of the solution representation. This framework describes the evolutionary search in a representation-independent way, purely in geometric terms, paving the road to a general theory of evolutionary algorithms. It also leads to a principled design methodology for the ...
متن کامل